The First Parameterized Algorithms and Computational Experiments Challenge
نویسندگان
چکیده
In this article, the steering committee of the Parameterized Algorithms and Computational Experiments challenge (PACE) reports on the first iteration of the challenge. Where did PACE come from, how did it go, who won, and what’s next? 1998 ACM Subject Classification F.2.2 Nonnumerical Algorithms and Problems, K.7.2 Organizations
منابع مشابه
The PACE 2017 Parameterized Algorithms and Computational Experiments Challenge: The Second Iteration
In this article, the Program Committee of the Second Parameterized Algorithms and Computational Experiments challenge (PACE 2017) reports on the second iteration of the PACE challenge. Track A featured the Treewidth problem and Track B the Minimum Fill-In problem. Over 44 participants on 17 teams from 11 countries submitted their implementations to the competition. 1998 ACM Subject Classificati...
متن کاملCamparison of Numerically Stability of Two Algorithms for the Calculation of Variance
In descriptive statistics, there are two computational algorithms for determining the variance S2, of a set of observations : Algorithm 1: S2= - , Algorithm 2: S2= , where . It is interesting to discuss, which of the above formulas is numerically more trustworthy in machine numbers sets. I this paper, based on total effect of rounding error, we prove that the second Algorithm is better...
متن کاملExperimental Evaluation of Parameterized Algorithms for Feedback Vertex Set
Feedback Vertex Set is a classic combinatorial optimization problem that asks for a minimum set of vertices in a given graph whose deletion makes the graph acyclic. From the point of view of parameterized algorithms and fixed-parameter tractability, Feedback Vertex Set is one of the landmark problems: a long line of study resulted in multiple algorithmic approaches and deep understanding of the...
متن کاملApplications of Parameterized Computation in Computational Biology
This paper first gives an introduction to parameterized computation and complexity theory, a new subfield in theoretical computer science. Then it presents a summary of its applications to addressing some important NP-hard problems in computational biology. Specifically, we can design efficient parameterized algorithms and also drive computational lower bounds for the parameterized algorithms a...
متن کاملHeuristic and exact algorithms for Generalized Bin Covering Problem
In this paper, we study the Generalized Bin Covering problem. For this problem an exact algorithm is introduced which can nd optimal solution for small scale instances. To nd a solution near optimal for large scale instances, a heuristic algorithm has been proposed. By computational experiments, the eciency of the heuristic algorithm is assessed.
متن کامل